Sampling of Min-Entropy Relative to Quantum Knowledge
نویسندگان
چکیده
منابع مشابه
(Quantum) Min-Entropy Resources
We model (interactive) resources that provide Alice with a string X and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system E such that the conditional (smooth) min-entropy of X given E is lower bounded by some k, H min(X |E) ≥ k. This (abstract) resource specification encompasses any setting that results in the honest players holding such a string...
متن کاملComputational Notions of Quantum Min-Entropy
We initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold. Our main results are as follows. (1) The classical Leakage Chain Rule for pseudoentropy can be extended to the case that the leakage information is quantum ...
متن کاملQuantum Dynamical Entropy from Relative entropy
In this exposition we prove an existence theorem for a quantum mechanical dynamical entropy based on von-Neumann’s measurement theory. To that end we introduced a Shannon type of information associated with a quantum channel or measurement based on Araki’s relative entropy. This is an invariance for the dynamics which generalizes Kolmogorov-Sinai ’s notion of dynamical entropy of a measure pres...
متن کاملInequalities for Quantum Relative Entropy
Some logarithmic trace inequalities involving the notions of relative entropy are reobtained from a log-majorization result. The thermodynamic inequality is generalized and a chain of equivalent statements involving this inequality and the Peierls-Bogoliubov inequality is obtained.
متن کاملBitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. König and Renner showed a min-entropy sampling theorem that holds relative to quantum knowledge. Their result achieves the optimal rate, but it can only be applied if the bits are sampled in block, and only gives weak bounds for non-smooth min-entr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2146730